منابع مشابه
Lower Bound on Testing
We introduce a new method of proving lower bounds on the depth of algebraic d-degree decision (resp. computation) trees and apply it to prove a lower bound (log N) (resp. (log N= log log N)) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N > (nd) (n) (resp. N > n (n)). This bound apparently does not follow from the methods developed ...
متن کاملA lower bound on IMMSE �
This paper provides upper and lower bounds on the information rates achievable with a minimum mean square error (MMSE) Tomlinson-Harashima precoder (THP) assuming ideal interleaving. We also give an exact formula for zero-forcing (ZF) THP achievable information rates. At high SNR, the performance of the MMSE-THP and the ZF-THP identically suuer only the 2.55 bit or 1.53 dB \shaping" loss from c...
متن کاملLower bound on the minus-domination number
For a graph G, a function f : V (G) ! f?1; 0; +1g is called a minus-domination function of G if the closed neighborhood of each vertex of G contains strictly more
متن کاملA Lower Bound on the Transposition Diameter
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among all pairs of permutations in Sn. It was previously conjectured [H. Eriksson et al., Discrete Math., 241 (2001), pp. 289–300] that TD(n) ≤ n+1 2 . This conjecture was disproved by Elias and Hartman [IEEE/ACM Trans. Com...
متن کاملOn the Alekhnovich–Razborov degree lower bound
Polynomial calculus is a Hilbert-style proof system in which lines are polynomials modulo x = x (for each variable x) and the rules allow deriving c1P1 + c2P2 from P1, P2 and xP from P for a variable x. A polynomial calculus refutation of a set of axioms is a derivation of 1 from these axioms. Research in proof complexity tends to concentrate on the length of proofs. We will rather be intereste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2018
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.120.091802